Efficient Bayesian Experimentation Using an Expected Information Gain Lower Bound
نویسندگان
چکیده
منابع مشابه
Lower Bound Bayesian Networks - An Efficient Inference of Lower Bounds on Probability Distributions in Bayesian Networks
We present a new method to propagate lower bounds on conditional probability distributions in conventional Bayesian networks. Our method guarantees to provide outer approximations of the exact lower bounds. A key advantage is that we can use any available algorithms and tools for Bayesian networks in order to represent and infer lower bounds. This new method yields results that are provable exa...
متن کاملDifferentiable lower bound for expected BLEU score
In natural language processing tasks performance of the models is often measured with some non-differentiable metric, such as BLEU score. To use efficient gradientbased methods for optimization, it is a common workaround to optimize some surrogate loss function. This approach is effective if optimization of such loss also results in improving target metric. The corresponding problem is referred...
متن کاملAn Improved Lower Bound for Bayesian Network Structure Learning
Several heuristic search algorithms such as A* and breadth-first branch and bound have been developed for learning Bayesian network structures that optimize a scoring function. These algorithms rely on a lower bound function called static k-cycle conflict heuristic in guiding the search to explore the most promising search spaces. The heuristic takes as input a partition of the random variables...
متن کاملLearning Predictive Interactions Using Information Gain and Bayesian Network Scoring
BACKGROUND The problems of correlation and classification are long-standing in the fields of statistics and machine learning, and techniques have been developed to address these problems. We are now in the era of high-dimensional data, which is data that can concern billions of variables. These data present new challenges. In particular, it is difficult to discover predictive variables, when ea...
متن کاملAn efficient lower bound algorithm for channel routing
Channel routing plays a central role in the physical design of VLSI chips. For two-layer dogleg-free channel routing, dm,, and v,, are the two traditional lower bounds. In this paper, we present two efficient algorithms for computing a tighter lower bound for the channel routing problem. Our algorithms succe:j~fully compute a lower bound of 26 for Deutsch's Difficult Example (DDE). The experime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM/ASA Journal on Uncertainty Quantification
سال: 2017
ISSN: 2166-2525
DOI: 10.1137/15m1043303